New Bounds for the Garden-Hose Model

نویسندگان

  • Hartmut Klauck
  • Supartha Podder
چکیده

We show new results about the garden-hose model. Our main results include improved lower bounds based on non-deterministic communication complexity (leading to the previously unknown Θ(n) bounds for Inner Product mod 2 and Disjointness), as well as an O(n · log n) upper bound for the Distributed Majority function (previously conjectured to have quadratic complexity). We show an efficient simulation of formulae made of AND, OR, XOR gates in the garden-hose model, which implies that lower bounds on the garden-hose complexity GH(f) of the order Ω(n ) will be hard to obtain for explicit functions. Furthermore we study a time-bounded variant of the model, in which even modest savings in time can lead to exponential lower bounds on the size of garden-hose protocols.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Garden Hose Complexity for the Equality Function

The garden hose complexity is a new communication complexity introduced by H. Buhrman, S. Fehr, C. Schaffner and F. Speelman [BFSS13] to analyze position-based cryptography protocols in 1 ar X iv :1 31 2. 72 22 v2 [ qu an tph ] 3 0 D ec 2 01 3 the quantum setting. We focus on the garden hose complexity of the equality function, and improve on the bounds of O. Margalit and A. Matsliah[MM12] with...

متن کامل

Position-Based Quantum Cryptography and the Garden-Hose Game

We study position-based cryptography in the quantum setting. We examine a class of protocols that only require the communication of a single qubit and 2n bits of classical information. To this end, we define a new model of communication complexity, the garden-hose model, which enables us to prove upper bounds on the number of EPR pairs needed to attack such schemes. This model furthermore opens...

متن کامل

MTRA: An on-line hose-model VPN provisioning algorithm

Virtual private networks (VPNs) provide customers with a secure and manageable communication environment. The allocation of bandwidth for VPNs to meet the requirements specified by customers is now one of the most important research issues in the field of traffic engineering. A VPN resource-provisioning model called hose-model was developed to provide customers with a flexible and convenient wa...

متن کامل

Exploring the Tractability of the Capped Hose Model

Robust network design concerns the design of networks to support uncertain or varying traffic patterns. An especially important case is the VPN problem, where the total traffic emanating from any node is bounded, but there are no further constraints on the traffic pattern. Recently, Fréchette et al. [10] studied a generalization of the VPN problem where in addition to these socalled hose constr...

متن کامل

Impacts of Premium Bounds on the Operation of Put Option and Day-ahead Electricity Markets

In this paper‎, ‎the impacts of premium bounds of put option contracts on the operation of put option and day-ahead electricity markets are studied‎. ‎To this end‎, ‎first a comprehensive equilibrium model for a joint put option and day-ahead markets is presented‎. ‎Interaction between put option and day-ahead markets‎, ‎uncertainty in fuel price, impact of premium bounds, and elasticity of con...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014